Asynchronous games 2: The true concurrency of innocence
نویسندگان
چکیده
منابع مشابه
Asynchronous Games 2: The True Concurrency of Innocence
In game semantics, the higher-order value passing mechanisms of the λ-calculus are decomposed as sequences of atomic actions exchanged by a Player and its Opponent. Seen from this angle, game semantics is reminiscent of trace semantics in concurrency theory, where a process is identified to the sequences of requests it generates in the course of time. Asynchronous game semantics is an attempt t...
متن کاملAsynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an alternating strategy with partial memory, in which the strategy plays according to its view. Extending the definition to nonalternating strategies is problematic, because the traditional definition of views is based on ...
متن کاملInnocence in 2-dimensional games
In this note, we reformulateHyland-Ong-Nickau pointer game semantics for PCF, as a more concurrent style of games, called 2-dimensional games. The main novelty of these games is that they are played on concurrent graphs, instead of trees. This enables to permute moves, and to decompose the innocence constraint on strategies, as local permutation properties. 1 Step one: reformulate pointer games...
متن کاملLogics and Games for True Concurrency
We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a uniform way by two simple and general dualities of local behaviour. Such dualities are used to define new mu-calculi and logic games for the analysis of concurren...
متن کاملTrue Concurrency = Interleaving Concurrency + Weak Conflict
In this paper we show that true concurrency is not the same as interleaving concur rency for systems that allow read access More precisely whenever two actions are interleavingly concurrent they are also truly concurrent but the converse is not al ways true due to a phenomena that we call weak con ict that allows the possibility of one writer to act in parallel with one or many readers
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.01.016